Traffic Dynamics in Scale-Free Networks
نویسندگان
چکیده
منابع مشابه
Dynamical traffic analysis on scale-free networks
Evaluation of trade-offs between dynamical characteristics and architecture design on large-scale networks is demanded for engineering solutions. We study dynamical characteristics of complex networks through both packet traffic simulation and theoretical network analysis to explore highperformance NoC (network-on-chip) architectures. To achieve efficient communication with hundreds of function...
متن کاملThe Effects of Link and Node Capacity on Traffic Dynamics in Weighted Scale-Free Networks
The effect of link and node capacity on traffic dynamics are investigated in weighted scale-free networks by adopting a traffic routing model with local node strength information: Pl→i = S i ∑
متن کاملTraffic dynamics in scale-free networks with limited packet-delivering capacity
We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node’s packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node i is proportional to k i , where ki is the degree of node i and φ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the...
متن کاملCascading toppling dynamics on scale-free networks
We study avalanche dynamics on scale-free networks, following a power-law degree distribution, pd ðkÞ k ; through the Bak–Tang–Wiesenfeld sandpile model. The threshold height of a node i is set to be k 1 Z i with 0pZo1: We obtain the exponents for the avalanche size and the duration distributions analytically as a function of g and Z by using the branching process approach. The analytic solutio...
متن کاملSandpile avalanche dynamics on scale-free networks
Avalanche dynamics is an indispensable feature of complex systems. Here, we study the self-organized critical dynamics of avalanches on scale-free networks with degree exponent through the Bak–Tang–Wiesenfeld (BTW) sandpile model. The threshold height of a node i is set as k1− i with 06 ¡ 1, where ki is the degree of node i. Using the branching process approach, we obtain the avalanche size and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexus
سال: 2006
ISSN: 1424-8492,1424-8506
DOI: 10.1159/000094192